FINDING AN OPTIMAL FLOOR LAYOUT INCLUDING PASSAGE AND DOORWAYS BASED ON A SEQUENCE-PAIR : Finding an optimal layout by combining mathematical programming and genetic algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal multi-floor plant layout based on the mathematical programming and particle swarm optimization

In the fields of researches associated with plant layout optimization, the main goal is to minimize the costs of pipelines and pumping between connecting equipment under various constraints. However, what is the lacking of considerations in previous researches is to transform various heuristics or safety regulations into mathematical equations. For example, proper safety distances between equip...

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

A DSS-Based Dynamic Programming for Finding Optimal Markets Using Neural Networks and Pricing

One of the substantial challenges in marketing efforts is determining optimal markets, specifically in market segmentation. The problem is more controversial in electronic commerce and electronic marketing. Consumer behaviour is influenced by different factors and thus varies in different time periods. These dynamic impacts lead to the uncertain behaviour of consumers and therefore harden the t...

متن کامل

two optimal algorithms for finding bi-directional shortest path design problem in a block layout

in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

متن کامل

An Optimal Distributed Bridge-Finding Algorithm

We model a computer network by a graph, where the vertices are computers and the edges are two-way communication links. It is a fundamental necessity that the graph be connected if the network is to operate as a whole. A bridge is an edge whose deletion causes the network to become disconnected. The bridges are the edges that are critical to network reliability. We give a simple, efficient dist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Architecture and Planning (Transactions of AIJ)

سال: 2003

ISSN: 1340-4210,1881-8161

DOI: 10.3130/aija.68.209_4